A new kernel Fisher discriminant algorithm with application to face recognition

نویسندگان

  • Jian Yang
  • Alejandro F. Frangi
  • Jing-Yu Yang
چکیده

Kernel-based methods have been of wide concern in the ,eld of machine learning and neurocomputing. In this paper, a new Kernel Fisher discriminant analysis (KFD) algorithm, called complete KFD (CKFD), is developed. CKFD has two advantages over the existing KFD algorithms. First, its implementation is divided into two phases, i.e., Kernel principal component analysis (KPCA) plus Fisher linear discriminant analysis (FLD), which makes it more transparent and simpler. Second, CKFD can make use of two categories of discriminant information, which makes it more powerful. The proposed algorithm was applied to face recognition and tested on a subset of the FERET database. The experimental results demonstrate that CKFD is signi,cantly better than the algorithms of Kernel Fisherface and Kernel Eigenface. c © 2003 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel-based Weighted Discriminant Analysis with QR Decomposition and Its Application to Face Recognition

Kernel discriminant analysis (KDA) is a widely used approach in feature extraction problems. However, for high-dimensional multi-class tasks, such as faces recognition, traditional KDA algorithms have a limitation that the Fisher criterion is non-optimal with respect to classification rate. Moreover, they suffer from the small sample size problem. This paper presents two variants of KDA called ...

متن کامل

Manifold Adaptive Kernel Local Fisher Discriminant Analysis for Face Recognition

To efficiently cope with the high dimensionalities and complex nonlinear variations of face images in face recognition task, a novel manifold adaptive kernel local Fisher discriminant analysis algorithm is proposed in this paper. The core idea of this algorithm is as follows: First, the local manifold structure of the face image is modeled by a nearest neighbor graph. Then, an original input ke...

متن کامل

Face Recognition Based on Optimal Kernel Minimax Probability Machine

Face recognition has received extensive attention due to its potential applications in many fields. To effectively deal with this problem, a novel face recognition algorithm is proposed by using the optimal kernel minimax probability machine. The key idea of the algorithm is as follows: First, the discriminative facial features are extracted with local fisher discriminant analysis (LFDA). Then,...

متن کامل

Face Recognition by Cognitive Discriminant Features

Face recognition is still an active pattern analysis topic. Faces have already been treated as objects or textures, but human face recognition system takes a different approach in face recognition. People refer to faces by their most discriminant features. People usually describe faces in sentences like ``She's snub-nosed'' or ``he's got long nose'' or ``he's got round eyes'' and so like. These...

متن کامل

Kernel Discriminant Analysis Based on Canonical Differences for Face Recognition in Image Sets

A novel kernel discriminant transformation (KDT) algorithm based on the concept of canonical differences is presented for automatic face recognition applications. For each individual, the face recognition system compiles a multi-view facial image set comprising images with different facial expressions, poses and illumination conditions. Since the multi-view facial images are non-linearly distri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2004